Probabilistic Tabu Search with Exponential Neighborhood for Bin Packing Problem
نویسندگان
چکیده
The one-dimensional bin packing problem is defined as follows [2]. Given a finite set I = {1, . . . , n} of items and two constants c and m. Each item has a positive weight wi > 0. Is it possible to partition the set I into m subsets such that the total weight of items in each subset doesn’t exceed c? This decision problem is NP-complete in strong sense and closely related to the following scheduling problem. Given n jobs and m identical parallel machines. Each job has operation time wi > 0. The aim is to minimize the total completion time, or makespan. It is easy to see that an algorithm for this optimization problem gives us solution for the decision problem.
منابع مشابه
A study on exponential-size neighborhoods for the bin packing problem with conflicts
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various application contexts such as logistics and transportation, timetabling, and resource allocation for cloud computing. We introduce O(1) evaluation proce...
متن کاملComparison of Meta-Heuristic Algorithms for Clustering Rectangles
In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...
متن کاملA Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...
متن کاملApplying Tabu Search with Innuential Diversiication to Multiprocessor Scheduling
We describe a tabu search approach to the scheduling problem of minimizing the makespan on n tasks on m equivalent processors. This problem is isomorphic to a variant of the multiple bin packing problem. We make use of a candidate list strategy that generates only a small subset of all possible moves, and employ a dynamic tabu list for handling tabu restrictions. We also introduce an innuential...
متن کاملMulti-Dimensional Packing by Tabu Search
The paper deals with multi-dimensional cutting and packing and metaheuristic algorithms. A brief overview of this area is presented, and the general Tabu Search framework of Lodi, Martello and Vigo [LMV99a] is considered in detail. Computational results on multi-dimensional bin packing problems are reported, and possible methods for extending the framework to other packing problems are finally ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001